Communication complexity of convex optimization
نویسندگان
چکیده
منابع مشابه
Communication Complexity of Distributed Convex Learning and Optimization
We study the fundamental limits to communication-efficient distributed methods for convex learningand optimization, under different assumptions on the information available to individual machines, andthe types of functions considered. We identify cases where existing algorithms are already worst-caseoptimal, as well as cases where room for further improvement is still possible. ...
متن کاملComplexity of Convex Optimization
We consider a situation where each one of two processors has access to a different convex function fi, i = 1,2, defined on a common bounded domain. The processors are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which fl + f2 is minimized, within some prespecified accuracy E. Our objective is to determine protocols under which the...
متن کاملConvex Optimization: Algorithms and Complexity
This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural optimization and stochastic optimization. Our presentation of black-box optimization, strongly influenced by Nesterov’s seminal book and Nemirovski’s lecture n...
متن کاملLocal Minimax Complexity of Stochastic Convex Optimization
We extend the traditional worst-case, minimax analysis of stochastic convex optimization by introducing a localized form of minimax complexity for individual functions. Our main result gives function-specific lower and upper bounds on the number of stochastic subgradient evaluations needed to optimize either the function or its “hardest local alternative” to a given numerical precision. The bou...
متن کاملCommunication Complexity of Distributed Resource Allocation Optimization
This paper investigates the communication complexity of distributed resource allocation problems. Communication complexity, which has emerged from computer science, measures the minimal number of communicated bits needed to solve some classes of problems regardless of the used algorithm, when the communication is lossless. We introduce two complexity measures for finding primal/dual saddle poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1987
ISSN: 0885-064X
DOI: 10.1016/0885-064x(87)90013-6